Extremal trees with given degree sequence for the Randić index

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The ABC Index of Trees with Given Degree Sequence∗

The atom–bond connectivity index of a graph G is defined as

متن کامل

On the extremal total irregularity index of n-vertex trees with fixed maximum degree

In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...

متن کامل

The extremal values of the Wiener index of a tree with given degree sequence

The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. In [1], the tree that minimizes the Wiener index among trees of given maximal degree is studied. We characterize trees that achieve the maxim...

متن کامل

Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence

The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. In [1], the tree that minimizes the Wiener index among trees of given maximal degree is studied. We characterize trees that achieve the maxim...

متن کامل

The Smallest Randić Index for Trees

The general Randić index Rα(G) is the sum of the weight d(u)d(v)α over all edges uv of a graph G, where α is a real number and d(u) is the degree of the vertex u of G. In this paper, for any real number α = 0, the first three minimum general Randić indices among trees are determined, and the corresponding extremal trees are characterized.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2008

ISSN: 0012-365X

DOI: 10.1016/j.disc.2007.06.026